Efficient algorithms for game-theoretic betweenness centrality
نویسندگان
چکیده
منابع مشابه
Fast Algorithms for Game-Theoretic Centrality Measures
In this dissertation, we analyze the computational properties of game-theoretic centrality measures. The key idea behind game-theoretic approach to network analysis is to treat nodes as players in a cooperative game, where the value of each coalition of nodes is determined by certain graph properties. Next, the centrality of any individual node is determined by a chosen game-theoretic solution ...
متن کاملGame theoretic network centrality: exact formulas and efficient algorithms
The concept of centrality plays an important role in network analysis. Game theoretic centrality measures have been recently proposed, which are based on computing the Shapley Value (SV) of each node (agent) in a suitably constructed co-operative network game (for example see [1]). However, the naive method of exact computation of SVs takes exponential time in the number of nodes. In this paper...
متن کاملEfficient algorithms for updating betweenness centrality in fully dynamic graphs
Betweenness centrality of a vertex (edge) in a graph is a measure for the relative participation of the vertex (edge) in the shortest paths in the graph. Betweenness centrality is widely used in various areas such as biology, transportation, and social networks. In this paper, we study the update problem of betweenness centrality in fully dynamic graphs. The proposed update algorithm substantia...
متن کاملEfficient Computation of Semivalues for Game-Theoretic Network Centrality
Solution concepts from cooperative game theory, such as the Shapley value or the Banzhaf index, have recently been advocated as interesting extensions of standard measures of node centrality in networks. While this direction of research is promising, the computation of game-theoretic centrality can be challenging. In an attempt to address the computational issues of game-theoretic network centr...
متن کاملBetweenness Centrality : Algorithms and Lower Bounds
One of the most fundamental problems in large scale network analysis is to determine the importance of a particular node in a network. Betweenness centrality is the most widely used metric to measure the importance of a node in a network. Currently the fastest known algorithm [5], to compute betweenness of all nodes, requires O(nm) time for unweighted graphs and O(nm + n logn) time for weighted...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2016
ISSN: 0004-3702
DOI: 10.1016/j.artint.2015.11.001